Stochastic Multifacility Location Problem under Circular Area Constraint with Euclidean Norm
نویسنده
چکیده
This investigation is the stochastic version of our previous work in which it is required to find the locations of a number of new facilities in a prescribed circular area constraint around the centre of gravity of a given number of existing facilities where the weights considered in the objective function are the random variables with discrete probabilities and the distance between the facilities is Euclidean. It has been assumed that the existing facilities are of one kind and the new facilities are of different kind with interactions between existing and new facilities as well as amongst new facilities. The stochastic multifacility location problem with circular area constraint has been formulated and solved by using Kuhn-Tucker conditions. A numerical example has also been solved by using the proposed method. Thus the outcome of the present work is a new method of finding the solution of a constrained stochastic multifacility location problem where the existing facilities are of one kind and the new facilities are of different kind.
منابع مشابه
Multifacility Location Problem using Scaled Conjugate Gradient Algorithm under Triangular Area Constraints
The problem of finding the multiple locations for new facilities with respect to the multiple existing facilities in a given environment is known as Multifacility Location Problem (MLP).Every location problem is normally bounded by some sort of area constraint. But the fact that much of the work carried out in the literature has almost neglected the area constraint which has motivated us to wor...
متن کاملMultifacility Location Problem using Scaled Conjugate Gradient Algorithm under Triangular Area Constraints
The problem of finding the multiple locations for new facilities with respect to the multiple existing facilities in a given environment is known as Multifacility Location Problem (MLP).Every location problem is normally bounded by some sort of area constraint. But the fact that much of the work carried out in the literature has almost neglected the area constraint which has motivated us to wor...
متن کاملAn Efficient Algorithm for Capacitated Multifacility Location Problems
In this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques ...
متن کاملEquivalent Primal and Dual Differentiable Reformulations of the Euclidean Multifacility Location Problem
As introduced earlier, the Euclidean Multifacility Location Problem (EMFLP) seeks to locate n new facilities at some points (xi, yi), i = 1, .., n in R 2 , in the presence of some m existing facilities located at specified points (aj, bj), j = 1, .., m, given certain interaction weights wij > 0 between designated pairs (i, j) of new and existing facilities in some indexpair set A NE , as well a...
متن کاملMultifacility Minimax Location Problems via Multi-Composed Optimization
We present a conjugate duality approach for multifacility minimax location problems with geometric constraints, where the underlying space is Fréchet and the distances are measured by gauges of closed convex sets. Besides assigning corresponding conjugate dual problems, we derive necessary and sufficient optimality conditions. Moreover, we introduce a further dual problem with less dual variabl...
متن کامل